MGUPGMA: A Fast UPGMA Algorithm With Multiple Graphics Processing Units Using NCCL
نویسندگان
چکیده
منابع مشابه
MGUPGMA: A Fast UPGMA Algorithm With Multiple Graphics Processing Units Using NCCL
A phylogenetic tree is a visual diagram of the relationship between a set of biological species. The scientists usually use it to analyze many characteristics of the species. The distance-matrix methods, such as Unweighted Pair Group Method with Arithmetic Mean and Neighbor Joining, construct a phylogenetic tree by calculating pairwise genetic distances between taxa. These methods have the comp...
متن کاملGPU-UPGMA: high-performance computing for UPGMA algorithm based on graphics processing units
Department of Computer Science, National Tsing Hua University, No. 101, Section 2, Kuang-Fu Road, Hsinchu City 30013, Taiwan Department of Computer Science and Information Engineering, Chang Gung University, No. 259, Sanmin Rd., Guishan Township, Taoyuan City 33302, Taiwan Department of Computer Science and Communication Engineering, Providence University, No. 200, Sec. 7, Taiwan Boulevard, Sha...
متن کاملFast Poisson Solvers for Graphics Processing Units
Two block cyclic reduction linear system solvers are considered and implemented using the OpenCL framework. The topics of interest include a simplified scalar cyclic reduction tridiagonal system solver and the impact of increasing the radix-number of the algorithm. Both implementations are tested for the Poisson problem in two and three dimensions, using a Nvidia GTX 580 series GPU and double p...
متن کاملFast free-form deformation using graphics processing units
A large number of algorithms have been developed to perform non-rigid registration and it is a tool commonly used in medical image analysis. The free-form deformation algorithm is a well-established technique, but is extremely time consuming. In this paper we present a parallel-friendly formulation of the algorithm suitable for graphics processing unit execution. Using our approach we perform r...
متن کاملFast MR Image Reconstruction using Graphics Processing Units
INTRODUCTION The computational cost of image reconstruction is an important practical issue. Although conventional fast Fourier transform (FFT) reconstructions are fast, many important emerging algorithms are computationally more expensive, including notable iterative algorithms designed for non-Cartesian k-space data, parallel imaging data, or data contaminated by physical effects like field i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Bioinformatics
سال: 2017
ISSN: 1176-9343,1176-9343
DOI: 10.1177/1176934317734220